K-tuple total domination in inflated graphs
نویسندگان
چکیده
منابع مشابه
k-TUPLE TOTAL DOMINATION IN INFLATED GRAPHS
The inflated graph GI of a graph G with n(G) vertices is obtained from G by replacing every vertex of degree d of G by a clique, which is isomorph to the complete graph Kd, and each edge (xi, xj) of G is replaced by an edge (u, v) in such a way that u ∈ Xi, v ∈ Xj , and two different edges of G are replaced by non-adjacent edges of GI . For integer k ≥ 1, the k-tuple total domination number γ ×...
متن کامل$k$-tuple total restrained domination/domatic in graphs
For any integer $kgeq 1$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple total dominating set of $G$ if any vertex of $G$ is adjacent to at least $k$ vertices in $S$, and any vertex of $V-S$ is adjacent to at least $k$ vertices in $V-S$. The minimum number of vertices of such a set in $G$ we call the $k$-tuple total restrained domination number of $G$. The maximum num...
متن کاملRoman k-Tuple Domination in Graphs
For any integer $kgeq 1$ and any graph $G=(V,E)$ with minimum degree at least $k-1$, we define a function $f:Vrightarrow {0,1,2}$ as a Roman $k$-tuple dominating function on $G$ if for any vertex $v$ with $f(v)=0$ there exist at least $k$ and for any vertex $v$ with $f(v)neq 0$ at least $k-1$ vertices in its neighborhood with $f(w)=2$. The minimum weight of a Roman $k$-tuple dominatin...
متن کاملk-tuple total domination and mycieleskian graphs
let $k$ be a positive integer. a subset $s$ of $v(g)$ in a graph $g$ is a $k$-tuple total dominating set of $g$ if every vertex of $g$ has at least $k$ neighbors in $s$. the $k$-tuple total domination number $gamma _{times k,t}(g)$ of $g$ is the minimum cardinality of a $k$-tuple total dominating set of $g$. if$v(g)=v^{0}={v_{1}^{0},v_{2}^{0},ldots ,v_{n}^{0}}$ and $e(g)=e_{0}$, then for any in...
متن کاملk-TUPLE TOTAL DOMINATION AND MYCIELESKIAN GRAPHS
Let k be a positive integer. A subset S of V (G) in a graph G is a k-tuple total dominating set of G if every vertex of G has at least k neighbors in S. The k-tuple total domination number γ×k,t(G) of G is the minimum cardinality of a k-tuple total dominating set of G. In this paper for a given graph G with minimum degree at least k, we find some sharp lower and upper bounds on the k-tuple tota...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2013
ISSN: 0354-5180
DOI: 10.2298/fil1302341k